Research on radar task scheduling with power constraint
نویسندگان
چکیده
منابع مشابه
Task Scheduling using Constraint Optimization with Uncertainty
Multiagent task scheduling encompasses diverse domains of problems that require complex models and robust solutions. C-TÆMS [1] is a new specification, based on TÆMS [2], for multiagent task scheduling problems that represents the complex relationships necessary to model these domains. Some recent work has been done in the area of mapping the C-TÆMS scheduling problem into a Distributed Constra...
متن کاملScheduling security constraint unit commitment for power system including stochastic wind power generation
This paper introduces a new approach for scheduling security constraint unit commitment (SCUC) including wind farms. Because of uncertainty in wind power production, we tried to develop a new method for incorporating wind power generation in power plant scheduling. For this, wind power generation modeled with unit commitment in a non-linear optimization problem and simulated by submitting diffe...
متن کاملStudy of Scheduling Problems with Machine Availability Constraint
In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...
متن کاملTask Scheduling Algorithm in Cloud Computing based on Power Factor
A very efficient computing environment is provided by cloud computing where the customers or several tenants are in need of multiple resources to be provided as a service over the internet. The challenge before the cloud service provider is, how efficiently and effectively the underlying computing resources like virtual machines, network, storage units, and bandwidth etc. should be managed so t...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Engineering
سال: 2019
ISSN: 2051-3305,2051-3305
DOI: 10.1049/joe.2019.0040